Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

三能级钾原子气体三维傅里叶变换频谱的解析解

利用投影切片定理、傅里叶位移定理和误差函数给出三能级钾原子气体三维傅里叶变换频谱在T=0界面的解析解.固定均匀线宽,非均匀展宽和对角线相关系数可以定量地识别,通过在适当方向上拟合三维傅里叶变换频谱谱峰的切片来确定.结果表明,非均匀展宽增大,频谱图沿着对角线方向延伸,对角线相关系数增大,频谱图逐渐变圆,振幅也逐渐变小.     

Eu:Lu2O3透明闪烁陶瓷的制备与性能

采用湿化学法合成了Eu原子掺量5%的Lu₂O₃陶瓷前驱体,通过SEM、XRD研究了煅烧前后前驱体和1 100 ℃煅烧4 h后粉体的形貌、结构以及物相。结果表明煅烧后的粉体为纳米类球形、高分散且结晶性良好的颗粒。颗粒尺寸为68.5 nm。使用煅烧后的粉体为原料,在1 650 ℃真空烧结30 h制备了高透过率的Eu:Lu₂O₃陶瓷,晶粒尺寸为46 μm,在611 nm处的直线透过率可以达到66.3%。此外对陶瓷的吸收曲线、光致激发和发射光谱特性以及X射线激发发射光谱进行研究。可观察到,Eu:Lu₂O₃陶瓷存在基质和激活离子两类吸收,光致发光光谱和X射线激发发射光谱均可以看出Eu:Lu₂O₃陶瓷存在极强的⁵D₀→⁷F₂跃迁发光,位于611 nm处。对比商业的BGO单晶的X射线发射光谱,可得本实验中制备的陶瓷的光输出为85 000 ph/MeV。Eu:Lu₂O₃陶瓷本身有着高X射线以及高能粒子的阻止能力,结合高光输出特性,表明Eu:Lu₂O₃陶瓷在X射线成像等领域具有巨大的潜在应用价值。     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

Inner derivations and norm equality

We characterize when the norm of the sum of two bounded operators on a Hilbert space is equal to the sum of their norms.

     

氢化丁苯共聚物结构的核磁共振波谱表征Ⅱ.微观结构的定量计算

在氢化丁苯共聚物¹³C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的¹H-和¹³C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。     

WEAK CONVERGENCE FOR NON-UNIFORM φ-MIXING RANDOM FIELDS

Let $\{\xi_{\bold t}, {\bold t} \in {\bold Z}^d\}$ be a nonuniform $\varphi$-mixing strictly stationary real random field with $E\xi_{\bold 0}=0, E|\xi_{\bold 0}|^{2+\delta}<\infty$ for some $0<\delta<1$. A sufficient condition is given for the sequence of partial sum set-indexed process $\{Z_n(A),\ A\in \Cal A\}$ to converge to Brownian motion. By a direct calculation, the author shows that the result holds for a more general class of set index ${\Cal A}$, where ${\Cal A}$ is assumed only to have the metric entropy exponent $r, 0相似文献   

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…